灰色预测模型在油气操作成本预测中的应用

油气操作成本是油气田生产消耗的主要项目，为了有效地控制油气操作成本，必须制定准确的油气操作成本计划。而油气操作成本在我国是最近几年才提出来的，数据项比较少，给油气操作成本预测带来一定的难度。为此，文章根据灰色预测的基本原理，采用灰色系统理论进行油气操作成本预测，就可以弥补对预测所需的数据少，而且也无须剔除不可比因素，只要所建模型能满足精度要求，预测结果就可以信赖。     

石化企业实时数据管理引擎设计与实现

实时数据管理系统是流程企业控制信息网络与管理信息网络平滑集成的基础，为两者的数据通讯提供桥梁。介绍了笔者在炼油化工C企业IMS建设中的实时数据管理引擎设计与开发，具有其先进性与实用性。     

FF现场总线的网段负载能力的设计及计算

从生产安全运行的管理要求；电压压降和电流的限制及信号的衰减；网络运行时间的要求；系统设计的影响；备用能力的考虑等各个方面，结合上海赛科聚苯乙烯项目的具体设计，分析隔爆条件下FF现场总线的H1网段负载能力的设计，以供大家探讨。     

一种分析碳酸盐岩孔隙系统数字图像的新方法

碳酸盐岩的孔隙类型多，孔径变化范围大，孔隙系统结构复杂，研究难度大。长期以来，是利用光学显微镜法、毛细管压力分析法、岩石孔隙系统复制法和图像分析仪法等方法或其中几种方法配合来研究碳酸盐岩孔隙系统。随着计算机图像技术的迅速发展和日益完善，借助该项技术通过碳酸盐岩孔隙系统数字图像来研究碳酸盐岩孔隙系统已经成为现实。文章提出一种研究碳酸盐岩孔隙系统数字图像的新方法。通过样品光薄片的光学显微镜（OM）数字图像和环境扫描电子显微镜（ESEM）数字图像二值化识别孔隙；构造孔隙度、孔隙贡献率和孔隙形状参数的计算公式用于数字图像分析，得到孔隙大小分布和孔隙形状分布。在此基础上，总结碳酸盐岩孔隙参数对其渗透率的控制作用。与传统的孔隙系统研究方法相比，该方法与计算机图像技术紧密结合，具有定量、快速的明显优势。     

岩性指示曲线重构及其在储层预测中的应用

大牛地上古生界岩性气藏主要发育在三角洲分流河道沉积的下石盒子组、海陆交互沉积的山西组及以潮坪相沉积为主的太原组,储层是储集性能较差的致密砂岩,平均孔隙度小于10％,渗透率小于1×10-2μm2,储层单层厚度一般小于10 m,砂体横向连通性较差。由于低孔、低渗特征导致储层与围岩的波阻抗差异微弱,用地震资料进行储层预测困难。为此,针对大牛地石板太工区优质储层的岩性特征和测井响应特征进行了测井综合分析,利用对岩性粒度敏感的自然伽马曲线,以及对岩性粒度响应频率较低,且与波阻抗有较好对应关系的中子曲线重构了岩性指示曲线。岩性指示曲线不仅可以有效地识别优质砂体,划分不同岩性,为地震、测井信息结合的岩性反演建立桥梁,同时也为反演结果识别气层打下了基础。利用岩性指示曲线、波阻抗和电阻率曲线进行的地震、测井联合反演技术在石板太工区取得了较好的效果,同时,对石板太工区下石盒子组盒2段、山2段进行了储层和含气性预测,划分了有利含气区带,部署的2口开发井和1口探井有2口井见气,其中1口井获高产气流。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

江阴长江公路大桥钢箱梁体受力分析

介绍了对大桥的风向、风力和交通流量的测试依据和内容，分析了风向、风力的测试结果以及梁体在风力及交通流量等作用下的受力情况，指出钢箱梁体主要受到的力是风力。     

AJAX在数据广播中的应用及实现

AJAX是Web2.0的核心技术之一,它其实是JavaScript和XML等多种技术的综合.由于AJAX的异步交互特性,使它在数据广播中将有很大的应用空间.分析了AJAX在数据广播中的主要应用方向,研究了AJAX在机顶盒中的实现.     

高速移动数据传输新标准IEEE 802.20

介绍了未来高速移动通信新标准IEEE802．20的总体概况，具体分析了IEEE802．20的技术特性、系统参考结构以及系统的组成模型，并对IEEE802．20标准前景分析与展望进行了详细描述。     

高保真电子管功放输出变压器的精确设计计算法

hi-end电子管功放音质优美绵厚,影响其音质的关键部件是输出变压器的电声性能,成为系统的喉舌。提出了一个新的方法,改变了以往粗略的估算法,使设计计算更合理﹑更科学﹑更实验化,成功解决了设计制造输出变压器的关键问题。